Tomas Böhm: 1945–2013

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Regular Böhm trees

Böhm trees are the natural infinite generalisations of normal forms in pure λ-calculus. They arose from the work of Böhm on separability (Böhm 1968), and were first identified by Barendregt, who devotes chapter 10 of his book (Barendregt 1980) to their study, and relates denotational models such as D∞ to appropriate quotients over Böhm trees. There is however no generally agreed presentation of...

متن کامل

Computing with Böhm Trees

This paper develops a general technique to analyze the head reduction of a term in a context. This technique is used to give a direct proof of the theorem of Hyland and Wadsworth : two -terms that have the same Böhm trees, up to (possibly infinite) -equivalence, are operationally equivalent. It is also used to prove a conjecture of R. Kerth : Every unsolvable -term has a decoration. This syntac...

متن کامل

An Extensional Böhm Model

We show the existence of an infinitary confluent and normalising extension of the finite extensional lambda calculus with beta and eta. Besides infinite beta reductions also infinite eta reductions are possible in this extension, and terms without head normal form can be reduced to bottom. As corollaries we obtain a simple, syntax based construction of an extensional Böhm model of the finite la...

متن کامل

Professor Tomas Pexieder (6.6.1941-28.10.1995).

While hiking in the Swiss Alps, Prof T Pexieder tragically lost his life on October 28th, 1995. Tomas Pexieder was born in Prague on the 6.6. 1941, where he undertook his undergraduate studie~ and received his M. D. in 1965 from Charles Universil y. During his last 3 years at medical school, he also dedicated himself to research at the Institute of Anatomy and published his first paper on adipo...

متن کامل

Böhm-Like Trees for Term Rewriting Systems

In this paper we define Böhm-like trees for term rewriting systems (TRSs). The definition is based on the similarities between the Böhm trees, the Lévy-Longo trees, and the Berarducci trees. That is, the similarities between the Böhm-like trees of the λ-calculus. Given a term t a tree partially represents the root-stable part of t as created in each maximal fair reduction of t. In addition to d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Scandinavian Psychoanalytic Review

سال: 2013

ISSN: 0106-2301,1600-0803

DOI: 10.1080/01062301.2013.852888